On Maximally Parallel Schemata

Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs

Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient condi...

On Schemata and systems for parallel algorithms

— The parallel program schemata of Karp and Miller are considérée for unbounded parallelism and their main decidability result is extended to this case. The complexity of these schemata is investigated and a scheduling algorithm is presented whose sequential time complexity is polynomial. The scheduling algorithm is applied to a schema representing the StrassenWinograd algorithm for multiplicat...

Expressing Control Mechanisms of Membranes by Rewriting Strategies

In this paper we present a rewriting semantics of membrane systems based on strategies. We use strategies to describe the control mechanisms in membranes. We provide strategies for maximally parallel rewriting, and for maximally parallel rewriting with priorities between rules. Maximally parallel rewriting with promoters or inhibitors requires an additional encoding of the rules.

Parallel Parsing: Diierent Distribution Schemata for Charts

Forma Analysis and Random Respectful Recombination

Intrinsic parallelism is shown to have application beyond schemata and o-schemata. More general objects called formae are introduced and general operators which manipulate these are introduced and discussed. These include random, respectful recombination. The extended formalism is applied to various common representations and standard operators are analysed in the light of the formalism.